AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
arxiv.org·1d
Issue 508
haskellweekly.news·57m
Using Local LLMs to Discover High-Performance Algorithms
towardsdatascience.com·2d
Subterms Modulo Theories I
philipzucker.com·3d
Building scalable agentic assistants: A graph-based approach
thenewstack.io·18h
Understanding AtoM to RiC Mappings in Mnemian
artefactual.com·1d
Explainer: Tree-sitter vs. LSP
lambdaland.org·1d
jameysharp/live-long-and-prospero: A small compiler for the Prospero Challenge in Constructive Solid Geometry
github.com·3d
Conversation: LLMs and the what/how loop
martinfowler.com·21h
Loading...Loading more...